Optimal placement of convex polygons to maximize point containment
نویسندگان
چکیده
منابع مشابه
Translating a Planar Object to Maximize Point Containment
Let C be a compact set in R and let S be a set of n points in R . We consider the problem of computing a translate of C that contains the maximum number, , of points of S. It is known that this problem can be solved in a time that is roughly quadratic in n. We show how random-sampling and bucketing techniques can be used to develop a near-linear-time Monte Carlo algorithm that computes a placem...
متن کاملIrregularities of Point Distribution Relative to Convex Polygons Iii
The situation is somewhat different when the aligned rectangles are replaced by similar copies of a given convex polygon. More precisely, suppose that 0 is a distribution of N points in the unit square U ̄ [0, 1]#, treated as a torus. Suppose that AXU is a closed convex polygon of diameter less than 1 and with centre of gravity at the origin O. For every real number r satisfying 0% r% 1 and ever...
متن کاملCounting Convex Polygons in Planar Point Sets
Given a set S of n points in the plane, we compute in time O(n) the total number of convex polygons whose vertices are a subset of S. We give an O(m n) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3; : : : ;m; previously known bounds were exponential (O(ndk=2e)). We also compute the number of empty convex polygons (resp., k-gons, k m) with vertices ...
متن کاملEmpty convex polygons in planar point sets
The Erdős–Szekeres theorem inspired a lot of research. A frequent topic in this area is the study of the existence of so-called empty convex polygons in finite planar point sets. Let P be a finite set of points in general position in the plane. A convex k-gon G is called a k-hole (or empty convex k-gon) of P , if all vertices of G lie in P and no point of P lies inside G. Frequently we will mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(98)00015-7